TSTP Solution File: SEV420^1 by cvc5-SAT---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5-SAT---1.0.5
% Problem : SEV420^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Nov 24 04:27:27 EST 2023
% Result : Unknown 2.29s 2.54s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV420^1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.13 % Command : do_cvc5 %s %d
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Nov 21 10:26:42 EST 2023
% 0.12/0.34 % CPUTime :
% 2.29/2.53 ------- cvc5-thf for SAT : /export/starexec/sandbox/tmp/tmp.IW7kQgARgS/cvc5---1.0.5_7931.p at 300...
% 2.29/2.53 --- Run --uf-ho --finite-model-find --ho-elim at 2...
% 2.29/2.53 --- Run --uf-ho --finite-model-find...
% 2.29/2.53 % SZS status GaveUp for cvc5---1.0.5_7931
% 2.29/2.53 % SZS output start CandidateFiniteModel for cvc5---1.0.5_7931
% 2.29/2.53 (
% 2.29/2.53 ; cardinality of $$unsorted is 1
% 2.29/2.53 ; rep: (as @$$unsorted_0 $$unsorted)
% 2.29/2.53 (define-fun tptp.in ((X $$unsorted) (M (-> $$unsorted Bool))) Bool (@ M X))
% 2.29/2.53 (define-fun tptp.is_a ((X $$unsorted) (M (-> $$unsorted Bool))) Bool (@ M X))
% 2.29/2.53 (define-fun tptp.emptyset ((BOUND_VARIABLE_1604 $$unsorted)) Bool false)
% 2.29/2.53 (define-fun tptp.unord_pair ((X $$unsorted) (Y $$unsorted) (U $$unsorted)) Bool (or (= X U) (= Y U)))
% 2.29/2.53 (define-fun tptp.singleton ((X $$unsorted) (U $$unsorted)) Bool (= X U))
% 2.29/2.53 (define-fun tptp.union ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) Bool (or (@ X U) (@ Y U)))
% 2.29/2.53 (define-fun tptp.excl_union ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) Bool (or (and (@ X U) (not (@ Y U))) (and (not (@ X U)) (@ Y U))))
% 2.29/2.53 (define-fun tptp.intersection ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) Bool (and (@ X U) (@ Y U)))
% 2.29/2.53 (define-fun tptp.setminus ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) Bool (and (@ X U) (not (@ Y U))))
% 2.29/2.53 (define-fun tptp.complement ((X (-> $$unsorted Bool)) (U $$unsorted)) Bool (not (@ X U)))
% 2.29/2.53 (define-fun tptp.disjoint ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) Bool (= (lambda ((BOUND_VARIABLE_1604 $$unsorted)) false) (lambda ((U $$unsorted)) (and (@ X U) (@ Y U)))))
% 2.29/2.53 (define-fun tptp.subset ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) Bool (forall ((U $$unsorted)) (or (not (@ X U)) (@ Y U))))
% 2.29/2.53 (define-fun tptp.meets ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) Bool (not (forall ((U $$unsorted)) (or (not (@ X U)) (not (@ Y U))))))
% 2.29/2.53 (define-fun tptp.misses ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) Bool (forall ((U $$unsorted)) (or (not (@ X U)) (not (@ Y U)))))
% 2.29/2.53 (define-fun tptp.is_function ((X (-> $$unsorted Bool)) (F (-> $$unsorted $$unsorted)) (Y (-> $$unsorted Bool))) Bool (forall ((E $$unsorted)) (or (not (@ X E)) (@ Y (@ F E)))))
% 2.29/2.53 (define-fun tptp.injection ((X (-> $$unsorted Bool)) (F (-> $$unsorted $$unsorted)) (Y (-> $$unsorted Bool))) Bool (=> (forall ((E $$unsorted)) (or (not (@ X E)) (@ Y (@ F E)))) (forall ((E1 $$unsorted) (E2 $$unsorted)) (or (not (@ X E1)) (not (@ X E2)) (not (= (@ F E1) (@ F E2))) (= E1 E2)))))
% 2.29/2.53 (define-fun tptp.surjection ((X (-> $$unsorted Bool)) (F (-> $$unsorted $$unsorted)) (Y (-> $$unsorted Bool))) Bool (=> (forall ((E $$unsorted)) (or (not (@ X E)) (@ Y (@ F E)))) (forall ((E1 $$unsorted)) (or (not (@ Y E1)) (not (forall ((E2 $$unsorted)) (or (not (@ X E2)) (not (= E1 (@ F E2))))))))))
% 2.29/2.53 (define-fun tptp.bijection ((X (-> $$unsorted Bool)) (F (-> $$unsorted $$unsorted)) (Y (-> $$unsorted Bool))) Bool (and (=> (forall ((E $$unsorted)) (or (not (@ X E)) (@ Y (@ F E)))) (forall ((E1 $$unsorted) (E2 $$unsorted)) (or (not (@ X E1)) (not (@ X E2)) (not (= (@ F E1) (@ F E2))) (= E1 E2)))) (=> (forall ((E $$unsorted)) (or (not (@ X E)) (@ Y (@ F E)))) (forall ((E1 $$unsorted)) (or (not (@ Y E1)) (not (forall ((E2 $$unsorted)) (or (not (@ X E2)) (not (= E1 (@ F E2)))))))))))
% 2.29/2.53 (define-fun tptp.equinumerous ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) Bool (not (forall ((F (-> $$unsorted $$unsorted)) (BOUND_VARIABLE_972 $$unsorted)) (or (and (or (not (@ X BOUND_VARIABLE_972)) (@ Y (@ F BOUND_VARIABLE_972))) (not (forall ((E1 $$unsorted) (E2 $$unsorted)) (or (not (@ X E1)) (not (@ X E2)) (not (= (@ F E1) (@ F E2))) (= E1 E2))))) (and (or (not (@ X BOUND_VARIABLE_972)) (@ Y (@ F BOUND_VARIABLE_972))) (not (forall ((E1 $$unsorted)) (or (not (@ Y E1)) (not (forall ((E2 $$unsorted)) (or (not (@ X E2)) (not (= E1 (@ F E2))))))))))))))
% 2.29/2.53 (define-fun tptp.embedding ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) Bool (not (and (forall ((BOUND_VARIABLE_1032 (-> $$unsorted $$unsorted)) (E $$unsorted)) (or (not (@ X E)) (@ Y (@ BOUND_VARIABLE_1032 E)))) (forall ((BOUND_VARIABLE_1040 (-> $$unsorted $$unsorted))) (not (forall ((E1 $$unsorted) (E2 $$unsorted)) (or (not (@ X E1)) (not (@ X E2)) (not (= (@ BOUND_VARIABLE_1040 E1) (@ BOUND_VARIABLE_1040 E2))) (= E1 E2))))))))
% 2.29/2.53 )
% 2.29/2.53 % SZS output end CandidateFiniteModel for cvc5---1.0.5_7931
% 2.29/2.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------